package 剑指Offer.easy;

public class 旋转数组的最小数字 {
    class Solution {
        public int minArray(int[] numbers) {
            if (numbers.length == 1) {
                return numbers[0];
            }
            for (int i = 1; i < numbers.length; i++) {
                if (numbers[i] < numbers[i - 1]) {
                    return numbers[i];
                }
            }
            //没有旋转
            return numbers[0];
        }
    }
}
